package leetcode_core.leetcode_2;


public class MergeTwoLists {
    class ListNode {
        int val;
        ListNode next;
        ListNode() {}
        ListNode(int val) { this.val = val; }
        ListNode(int val, ListNode next) { this.val = val; this.next = next; }
    }

    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        ListNode dummy = new ListNode(-1);
        ListNode head = dummy;
        ListNode p1 = list1,p2=list2;
        while (p1!= null && p2!=null) {
            if(p1.val >= p2.val){
                dummy.next = p2;
                p2 = p2.next;
            }else{
                dummy.next = p1;
                p1 = p1.next;
            }
            dummy = dummy.next;
        }
        if(p1!=null) {
            dummy.next = p1;
        }
        if(p2!=null){
            dummy.next=p2;
        }
        return head.next;
    }



}
